public class demo9 {
    //最小花费爬楼梯问题
    //O(N)
    public int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        //1.建表
        int[] dp = new int[n+1];
        //2.初始化
        dp[0] = 0;
        dp[1] = 0;
        //3.填表]
        for(int i = 2;i<=n;i++)
            dp[i] = Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
        //4.返回值
        return dp[n];
    }
}
